复杂空、海域的一种简洁管理算法

根据复变函数理论 ,首次提出了一种可对任何复杂空 /海域进行管理的简洁算法 ,解决了以往系统中不能解决或很难解决的复连通区域和凹多边形区域的管理问题     

Selecting T for a periodic review inventory model with staggered deliveries

Consider a single‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. Orders can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every T periods, one audits the current stock level and decides on deliveries for the next T periods, thus incurring a fixed audit cost and—when one schedules deliveries—a fixed order cost. The problem is to find a review period T and an ordering policy that satisfy the average cost criterion. The current article extends an earlier treatment of this problem, which assumed that the fixed order cost is automatically incurred once every T periods. We characterize an optimal ordering policy when T is fixed, prove that an optimal review period T** exists, and develop a global search algorithm for its computation. We also study the behavior of four approximations to T** based on the assumption that the fixed order cost is incurred during every cycle. Analytic results from a companion article (where μ/σ is large) and extensive computational experiments with normal and gamma demand test problems suggest these approximations and associated heuristic policies perform well when μ/σ ≥ 2. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 329–352, 2000     

Minimizing makespan in a multimode multiprocessor shop scheduling problem

We study the problem of multimode scheduling tasks on dedicated processors, with the objective of minimizing the maximum completion time. Each task can be undertaken in one among a set of predefined alternative modes, where each mode specifies a required set of dedicated processors and a processing time. At any time each processor can be used by a single task at most. General precedence constraints exist among tasks, and task preemption is not allowed. The problem consists of assigning a mode and a starting time to each task, respecting processor and precedence constraints, to minimize the time required to complete all tasks. The problem is NP-hard in several particular cases. In previous works, we studied algorithms in which a solution was obtained by means of an iterative procedure that combines mode assignment and sequencing phases separately. In this paper, we present some new heuristics where the decision on the mode assignment is taken on the basis of a partial schedule. Then, for each task, the mode selection and the starting time are chosen simultaneously considering the current processor usage. Different lower bounds are derived from a mathematical formulation of the problem and from a graph representation of a particular relaxed version of the problem. Heuristic solutions and lower bounds are evaluated on randomly generated test problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 893–911, 1999     

On lifetimes in random environments

For a component operating in random environment, whose hazard rate is assumed to be the realization of a suitable increasing stochastic process, conditions are found such that its lifetime is increasing in likelihood ratio (ILR). For the lifetimes of two components of the same kind some comparisons based on partial stochastic orders are presented. Some applications to the case of repairable components are finally provided. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 365–375, 1998     

仿鱼长鳍波动推进器研究的进展与分析

仿鱼长鳍波动推进是未来水下航行器的一个发展趋势和重要的研究方向,文章介绍了长鳍波动推进器的生物学背景,分析了长鳍波动推进的数学方法,对国内外仿鱼长鳍波动推进器的研究现状和取得的成果进行了综述,并扼要分析了目前仿鱼长鳍波动推进器控制研究的主要问题。推进系统控制遇到的挑战是大扰动情况下的状态保持、迅速机动、高效持久推进和轨迹规划与跟踪,从推进器的设计和控制上解决这些困难将依赖于工程技术科学和生物科学的进展状况。     

跳跃-滑翔弹道扰动引力自适应网格快速赋值方法

为实现高超声速跳跃-滑翔弹道扰动引力的快速赋值,提出自适应网格赋值模型,并根据反距离加权理论,优化广义延拓逼近算法,对模型的逼近误差进行分析。该赋值模型的网格划分为两级,第一级网格根据标准弹道空域进行划分,第二级网格根据滑翔导弹实际弹道在线生成。根据一级网格节点数据,通过优化广义延拓逼近算法计算二级网格节点数据,最后根据二级单元内插计算实际弹道点的扰动引力值。仿真结果表明:在同等大小的网格划分下,优化广义延拓自适应网格模型的逼近精度高于一般赋值方法;在同等精度要求下,该赋值模型的最大单元格边长大于一般赋值方法,从而减少了单元格划分数量,进而降低弹上数据存储量;针对不同滑翔方向以及不同滑翔距离的跳跃-滑翔弹道,该模型逼近误差对应的落点偏差小于5 m,具有较好的适应性。该赋值模型在满足计算速度的前提下,提高了传统赋值方法的逼近精度,降低了弹上存储量,具有一定的工程应用价值。     

P一致光滑空间中一类非线性算子的不动点逼近

在P一致光滑的Banach空间中。证明了满足一定条件的Ishikawa迭代序列强收敛于非Lipschitz算子的不动点。     

一种有效的神经网络检测器

本文提出了一种有效的神经网络检测方法。该方法通过高效的自组织学习过程,使该神经网络对各种噪声或杂波分布能够快速准确地建模,最终能使在各种噪声分布条件下检测效果均逼近最佳检测器的性能。实验结果验明了该方法的有效性     

离散变结构控制系统的变速趋近律

首次提出了离散变结构控制的变速趋近律．文中指出,在变速趋近律的制约下,会出现扇形的切换区．给出了扇形切换区准滑动模态的数学模型．     

采用SHLPN分析特种车载总线网络可靠性

针对特种车载总线网络可靠性难以评估的问题,提出采用随机高级Petri网(Stochastic High-level Petri Net,SHLPN)分析特种车载总线网络可靠性。深入分析特种车载总线网络故障模式的基础上,将其等效为冗余总线控制器模块、远程终端模块和冗余链路模块的串联,分别建立各个模块的SHLPN模型,得到了各个模块的稳态可用度计算式,进而综合得到特种车载总线网络的稳态可用度计算式。最后,实例分析验证了所提方法的有效性。